Performance Study of Routing Algorithms for LEO Satellite Constellations
نویسندگان
چکیده
A comparative study of routing techniques is carried out on complicated LEO constellations interconnecting high speed terrestrial networks. Shortest path routing as well as optimal routing (flow deviation) methods are applied for balanced and unbalanced traffic load and for uniform and non uniform distribution of the earth stations. The performance of flow deviation method is proved to be very successful even for these big networks after a modification of the algorithm regarding the selection of the number of paths we work with. It is proved that a k-paths flow deviation method is always easy to obtain and gives robust results at a very affordable algorithmic complexity.
منابع مشابه
Various Routing Techniques for non-GEO Satellite Constellations
Two different routing algorithm categories are studied in this paper for a typical LEO satellite constellation. Shortest path algorithms and optimal routing. Their performance is investigated through extended real time simulations. In the context of satellite constellations the basic parameters for a typical network such as delay, throughput, link utilization must be supplemented by new factors...
متن کاملPerformance study of adaptive routing algorithms for LEO satellite constellations under Self-Similar and Poisson traffic
A comparative study of routing techniques is carried out for LEO constellations interconnecting high speed terrestrial networks assuming Poison and Self-Similar input traffic. Shortest path routing as well as optimal routing (flow deviation) methods are applied for balanced and unbalanced traffic load and for uniform and non uniform distribution of the earth stations. The performance of flow de...
متن کاملInternet Routing over LEO Satellite Constellations
Satellite constellations ooer interesting perspectives for Internet traac routing, since they beneet from a worldwide coverage and do not have the main drawback of geosynchronous satellites : propagation delay. However, because of their low altitude, LEO satellites are in constant motion and exhibit speciic issues for routing. This article presents a general architecture applicable to the integ...
متن کاملPriority-based Adaptive Shortest Path Routing for IP over LEO Satellite Networks
Designing an efficient routing algorithm for LEO satellite constellations is crucial for optimizing IP over Satellite (IPoS) network resources. Since there could be many shortest paths between two satellites, an efficient routing algorithm should provide better utilization of these paths. For this purpose, we propose a Priority-based Adaptive Routing (PAR) technique, which distributedly sets th...
متن کاملGaliLEO A SIMULATION TOOL FOR TRAFFIC ON LEO SATELLITE CONSTELLATIONS PRESENTATION OF THE ARCHITECTURE
The aim of this work is to create a tool that can simulate the transmission of both connectionoriented and connection-less traffic over a constellation of LEO/MEO (Low Earth Orbit/ Medium Earth Orbit) satellites. We hope to provide a performance evaluation of various constellation access techniques and routing policies. The simulator, named GaliLEO, will be written in Java and will integrate re...
متن کامل